Computational Problems in Strong Visibility
نویسندگان
چکیده
Strong visibility is a generalization of standard visibility, defined with respect to a fixed set of line orientations. We investigate computational properties of this generalized visibility, as well as the related notion of strong convexity. In particular, we describe algorithms for the following tasks: 1. Testing the strong visibility of two points in a polygon and the strong convexity of a polygon. 2. Finding the strong convex hull of a point set and that of a simple polygon. 3. Constructing the strong kernel of a polygon. 4. Identifying the set of points that are strongly visible from a given point.
منابع مشابه
On the Complexity of Visibility Problems with Moving Viewpoints
We investigate visibility problems with moving viewpoints in n-dimensional space. We show that these problems are NP-hard if the underlying bodies are balls, H-polytopes, or V-polytopes. This is contrasted by polynomial time solvability results for fixed dimension. We relate the computational complexity to existing algebraic-geometric aspects of the visibility problems, to the theory of packing...
متن کاملPlanar Strong Visibility
The study of nontraditional notions of visibility and convexity is a fruitful branch of geometry, which has found applications in vlsi design, graphics, and motion planning. Researchers have investigated multiple variations of these notions, including orthogonal, finitely oriented, and restricted-orientation visibility and convexity, as well as nesw and link convexity. Rawlins introduced the no...
متن کاملMotion Planning and Visibility Problems using the Polar Diagram
Motion planning and visibility problems are some of the most important topics studied in Computer Graphics, Computational Geometry and Robotics. There exits several and important results to these problems. We propose a new approach in this paper using a preprocessing in the plane, the polar diagram. The polar diagram can be considered as a plane tessellation with similar characteristics to the ...
متن کاملKinetic Visibility
In this paper, we survey kinetic visibility problems. Unlike the research in traditional visibility problems, the researchers have also taken moving objects into consideration. These problems have been addressed from different practical aspects, such as computational graphics and robotic design. Over the years, some general combinatorial results of the visibility graph have been shown. Leveragi...
متن کامل4. Conclusions 5. Acknowledgment 6. References
In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge are presented. The following computational problem ...
متن کامل